New skew equienergetic oriented graphs
Authors
Abstract:
Let $S(G^{sigma})$ be the skew-adjacency matrix of the oriented graph $G^{sigma}$, which is obtained from a simple undirected graph $G$ by assigning an orientation $sigma$ to each of its edges. The skew energy of an oriented graph $G^{sigma}$ is defined as the sum of absolute values of all eigenvalues of $S(G^{sigma})$. Two oriented graphs are said to be skew equienergetic iftheir skew energies are equal. In this paper, we determine the skew spectra of some new oriented graphs. As applications, we give somenew methods to construct new non-cospectral skew equienergetic oriented graphs.
similar resources
More skew-equienergetic digraphs
Two digraphs of same order are said to be skew-equienergetic if their skew energies are equal. One of the open problems proposed by Li and Lian was to construct non-cospectral skew-equienergetic digraphs on n vertices. Recently this problem was solved by Ramane et al. In this paper, we give some new methods to construct new skew-equienergetic digraphs.
full textSkew Spectra of Oriented Graphs
An oriented graph G is a simple undirected graph G with an orientation σ, which assigns to each edge a direction so that G becomes a directed graph. G is called the underlying graph of G, and we denote by Sp(G) the adjacency spectrum of G. Skew-adjacency matrix S(G) of G is introduced, and its spectrum SpS(G ) is called the skew-spectrum of G . The relationship between SpS(G ) and Sp(G) is stud...
full textMore Equienergetic Signed Graphs
The energy of signed graph is the sum of the absolute values of the eigenvalues of its adjacency matrix. Two signed graphs are said to be equienergetic if they have same energy. In the literature the construction of equienergetic signed graphs are reported. In this paper we obtain the characteristic polynomial and energy of the join of two signed graphs and thereby we give another construction ...
full textskew equienergetic digraphs
let $d$ be a digraph with skew-adjacency matrix $s(d)$. the skew energy of $d$ is defined as the sum of the norms of all eigenvalues of $s(d)$. two digraphs are said to be skew equienergetic if their skew energies are equal. we establish an expression for the characteristic polynomial of the skew adjacency matrix of the join of two digraphs, and for the respective skew energ...
full textD - Equienergetic Self - Complementary Graphs
The D-eigenvalues {μ1, μ2, . . . , μn} of a graph G are the eigenvalues of its distance matrix D and form the D-spectrum of G denoted by specD(G) . The D-energy ED(G) of the graph G is the sum of the absolute values of its D-eigenvalues. We describe here the distance spectrum of some self-complementary graphs in the terms of their adjacency spectrum. These results are used to show that there ex...
full textOn oriented graphs with minimal skew energy
Let S(Gσ) be the skew-adjacency matrix of an oriented graph Gσ . The skew energy of Gσ is the sum of all singular values of its skew-adjacency matrix S(Gσ). This paper first establishes an integral formula for the skew energy of an oriented graph. Then, it determines all oriented graphs with minimal skew energy among all connected oriented graphs on n vertices with m (n ≤ m < 2(n− 2)) arcs, whi...
full textMy Resources
Journal title
volume 4 issue 1
pages 15- 24
publication date 2019-06-01
By following a journal you will be notified via email when a new issue of this journal is published.
Keywords
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023